Viscous Problems with Inviscid Approximations in Subregions : a New Approach Based on Operator Factorization
نویسندگان
چکیده
In many applications the viscous terms become only important in parts of the computational domain. As a typical example serves the flow around the wing of an airplane, where close to the wing the viscous terms in the Navier Stokes equations are essential for the solution, while away from the wing, Euler’s equations would suffice for the simulation. This leads to the interesting problem of finding coupling conditions between these two partial differential equations of different type. While coupling conditions have been developed in the literature, for example by using a limiting procedure on a globally viscous problem, we are interested here to develop coupling conditions which lead to coupled solutions which are as close as possible to the fully viscous solution. We develop our new approach on the one dimensional model problem of advection reaction diffusion equations with pure advection reaction approximation in subregions, which leads to the problem of coupling first and second order operators. Our guiding principle for finding transmission conditions is an operator factorization, and we show both analytically and numerically that the new coupling conditions lead to coupled solutions which are much closer to the fully viscous ones than other coupling conditions from the literature.
منابع مشابه
How Close to the Fully Viscous Solution Can One Get with Inviscid Approximations in Subregions ?
متن کامل
How Close to the Fully Viscous Solution can one get When Inviscid Approximations are Used in Subregions ?
متن کامل
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملFactorization and Approximation Problems for Matrix Functions
The purpose of this paper is to develop a new approach to certain approximation and factorization problems for matrix-valued functions. The approach is based on studying properties of maximizing vectors of Hankel operators with matrix-valued symbols and on the solution of the so-called recovery problem for unitary-valued matrix functions. In the case of scalar functions such problems were studi...
متن کاملNew operational matrix for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative
In this paper, we apply spectral method based on the Bernstein polynomials for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative. In the first step, we introduce the dual basis and operational matrix of product based on the Bernstein basis. Then, we get the Bernstein operational matrix for the Jumarie’s modified Riemann-Liouville fractio...
متن کامل